Induced and Non-induced Forbidden Subposet Problems
نویسنده
چکیده
The problem of determining the maximum size La(n, P ) that a P -free subposet of the Boolean lattice Bn can have, attracted the attention of many researchers, but little is known about the induced version of these problems. In this paper we determine the asymptotic behavior of La∗(n, P ), the maximum size that an induced P -free subposet of the Boolean lattice Bn can have for the case when P is the complete two-level poset Kr,t or the complete multi-level poset Kr,s1,...,sj ,t when all si’s either equal 4 or are large enough and satisfy an extra condition. We also show lower and upper bounds for the non-induced problem in the case when P is the complete three-level poset Kr,s,t. These bounds determine the asymptotics of La(n,Kr,s,t) for some values of s independently of the values of r and t.
منابع مشابه
1 2 Ju n 20 11 Set families with a forbidden induced subposet
For each poset H whose Hasse diagram is a tree of height k, we show that the largest size of a family F of subsets of [n] = {1, . . . , n} not containing H as an induced subposet is asymptotic to (k − 1) ( n ⌊n/2⌋ ) . This extends the result of Bukh [4], which in turn generalizes several known results including Sperner’s theorem. 1
متن کاملSet Families with a Forbidden Subposet
We asymptotically determine the size of the largest family F of subsets of {1, . . . , n} not containing a given poset P if the Hasse diagram of P is a tree. This is a qualitative generalization of several known results including Sperner’s theorem. Introduction We say that a poset P is a subposet of a poset P ′ if there is an injective map f : P → P ′ such that a 6P b implies f(a) 6P ′ f(b). A ...
متن کاملExact Forbidden Subposet Results using Chain Decompositions of the Cycle
We introduce a method of decomposing the family of intervals along a cyclic permutation into chains to determine the size of the largest family of subsets of [n] not containing one or more given posets as a subposet. De Bonis, Katona and Swanepoel determined the size of the largest butterfly-free family. We strengthen this result by showing that, for certain posets containing the butterfly pose...
متن کاملSet families with forbidden subposets
Let F be a family of subsets of {1, . . . , n}. We say that F is P -free if the inclusion order on F does not contain P as an induced subposet. The Turán function of P , denoted La∗(n, P ), is the maximum size of a P -free family of subsets of {1, . . . , n}. We show that La∗(n, P ) ≤ (4r + O( √ r)) ( n bn/2c ) if P is an r-element poset of height at most 2. We also show that La∗(n, Sr) = (r + ...
متن کاملCharacterizing subclasses of cover-incomparability graphs by forbidden subposets
In this paper we demonstrate that several theorems from [1] and [3] do not hold as they are stated. These are the theorems regarding forbidden subposet characterizations of certain classes of coverincomparability graphs. In this paper we correct a mistake in the main theorem of [1], reformulate the corresponding statements and present corrected proofs. We further characterize posets whose cover...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015